On the Existence of Perfect Codes for Asymmetric Limited-Magnitude Errors
نویسندگان
چکیده
Block codes, which correct asymmetric errors with limited-magnitude, are studied. These codes have been applied recently for error correction in flash memories. The codes will be represented by lattices and the constructions will be based on a generalization of Sidon sequences. In particular we will consider perfect codes for these type of errors.
منابع مشابه
Tilings With $n$ -Dimensional Chairs and Their Applications to Asymmetric Codes
An n-dimensional chair consists of an n-dimensional box from which a smaller n-dimensional box is removed. A tiling of an n-dimensional chair has two nice applications in some memories using asymmetric codes. The first one is in the design of codes which correct asymmetric errors with limited-magnitude. The second one is in the design of n cells q-ary write-once memory codes. We show an equival...
متن کاملSome codes correcting single symmetric errors of limited magnitude
An error model with symmetric errors of limited magnitude is considered. Limited magnitude means that the size of any error is limited by a number smaller (usually much smaller) than the alphabet size. Several constructions of codes correcting single error are given. In some cases, the codes are perfect or quasi-perfect.
متن کاملGeneralized Bose-Lin Codes, a Class of Codes Detecting Asymmetric Errors
Bose and Lin introduced a class of systematic codes for detection of binary asymmetric errors. Later, in [4] this class was generalized and the Generalized Bose-Lin (GBL) codes were introduced. In this note, we describe a Generalized Bose-Lin codes of limited magnitude l. For these codes, the possible undetectable errors are characterized, the undetectable errors of minimum weight are determine...
متن کاملOptimal, systematic, q-ary codes correcting all asymmetric and symmetric errors of limited magnitude
Systematic -ary ( ) codes capable of correcting all asymmetric errors of maximum magnitude , where , are given. These codes are shown to be optimal. Further, simple encoding/decoding algorithms are described. The proposed code can be modified to design codes correcting all symmetric errors of maximum magnitude , where .
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1112.0896 شماره
صفحات -
تاریخ انتشار 2011